منابع مشابه
Annealing and the normalized N-cut
We describe an annealing procedure that computes the normalized N-cut of a weighted graph G. The first phase transition computes the solution of the approximate normalized 2-cut problem, while the low temperature solution computes the normalized N-cut. The intermediate solutions provide a sequence of refinements of the 2-cut that can be used to split the data to K clusters with 2 </= K </= N. T...
متن کاملBipartition of graphs based on the normalized cut and spectral methods, Part I: Minimum normalized cut
The main objective of this paper is to solve the problem of finding graphs on which the spectral clustering method and the normalized cut produce different partitions. To this end, we derive formulae for minimum normalized cut for graphs in some classes such as paths, cycles, complete graphs, double-trees, lollipop graphs LPn,m, roach type graphs Rn,k and weighted paths Pn,k.
متن کاملNormalized Cut Meets MRF
We propose a new segmentation or clustering model that combines Markov Random Field (MRF) and Normalized Cut (NC) objectives. Both NC and MRF models are widely used in machine learning and computer vision, but they were not combined before due to significant differences in the corresponding optimization, e.g. spectral relaxation and combinatorial max-flow techniques. On the one hand, we show th...
متن کاملGANC: Greedy Agglomerative Normalized Cut
This paper describes a graph clustering algorithm that aims to minimize the normalized cut criterion and has a model order selection procedure. The performance of the proposed algorithm is comparable to spectral approaches in terms of minimizing normalized cut. However, unlike spectral approaches, the proposed algorithm scales to graphs with millions of nodes and edges. The algorithm consists o...
متن کاملAnalysis of MinCut , Average Cut , and Normalized Cut Measures ( Extended
Partitioning of a graph representation, defined over low-level image features based on Gestalt inspired relations, is an effective strategy for forming coherent perceptual groups in an image. The usual practice, mainly motivated by efficiency considerations, is to approximate the general K-way partitioning solution by recursive bi-partitioning, where at each step the graph is broken into two pa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Pattern Recognition
سال: 2008
ISSN: 0031-3203
DOI: 10.1016/j.patcog.2007.06.014